The Maximum Displacement for Linear Probing Hashing
نویسندگان
چکیده
منابع مشابه
The Maximum Displacement for Linear Probing Hashing
In this paper we study the maximum displacement for linear probing hashing. We use the standard probabilistic model together with the insertion policy known as First-Come(-First-Served). The results are of asymptotic nature and focus on dense hash tables. That is, the number of occupied cells n, and the size of the hash table m, tend to infinity with ratio n/m → 1. We present distributions and ...
متن کاملString hashing for linear probing
Linear probing is one of the most popular implementations of dynamic hash tables storing all keys in a single array. When we get a key, we first hash it to a location. Next we probe consecutive locations until the key or an empty location is found. At STOC’07, Pagh et al. presented data sets where the standard implementation of 2-universal hashing leads to an expected number of Ω(log n) probes....
متن کاملAsymptotic distribution for the cost of linear probing hashing
We study moments and asymptotic distributions of the construction cost, measured as the total displacement, for hash tables using linear probing. Four different methods are employed for different ranges of the parameters; together they yield a complete description. This extends earlier results by Flajolet, Poblete and Viola. The average cost of unsuccessful searches is considered too.
متن کاملHashing with Linear Probing and Frequency Ordering
Linear probing of a scatte r (or hash) table interpre ts each key or item (these terms are inte rchangea ble here) as a probe index into the table [1]. 1 Typically, a key is divided by the table size and the remainder is used for indexing. If the selected slot is empty, the item is not present. Should the slot contain some other key, eacl1 next highe r location is checked until the item is foun...
متن کاملLinear Probing with 5-Independent Hashing
These lecture notes show that linear probing takes expected constant time if the hash function is 5-independent. This result was first proved by Pagh et al. [STOC’07,SICOMP’09]. The simple proof here is essentially taken from [Pǎtraşcu and Thorup ICALP’10]. We will also consider a smaller space version of linear probing that may have false positives like Bloom filters. These lecture notes illus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2013
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548312000582